Eecient Processing of Conical Queries
نویسندگان
چکیده
Conical queries are a novel type of query with an increasing number of applications. Traditional index structures and retrieval mechanisms, in general, have been optimized for rectangular and circular queries, rather than conical queries. In this paper, we focus on conical queries which can be deened as a multi-dimensional cone in a multi-dimensional data space. We develop a model for expressing such queries and suggest eecient techniques for evaluating them. In particular, we explore the retrieval problem in the context of conical query processing and develop multi-disk allocation methods speciically for processing conical queries.
منابع مشابه
Integrated Query Processing Strategies for Spatial Path Queries
Path search and spatial query processing have been treated thus far as two disjoint areas by the database research community. However, to process a path query such as \Find the shortest path from my home to the ski resort that only goes through areas with an altitude < 1000 feet" requires database support in both path computation and spatial query processing. While support for such spatial path...
متن کاملEecient Transaction Management & Query Processing in Massive Digital Databases
We address several important issues that arise in the development of Massive Digital Database Systems (MDDSs) in which data is being added continuously and on which users pose queries on the y. News-on-demand and document retrieval systems are examples of systems that have these characteristics. Given the size of data, metadata such as index structures become even more important in these system...
متن کاملQuery Processing in a Video Retrieval System
In an earlier paper, we designed a similarity based video retrieval system. Queries are speciied in a language called Hierarchical Temporal Language (HTL). In this paper, we present several extensions of the HTL language. These extensions include queries that can have the negation operator and any other logical and temporal operators such as disjunction. EEcient algorithms for processing querie...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملAn Eecient Uniication Algorithm for a Logic Database Language for Nested Relations
Although eecient uniication algorithms exist for logic database queries for at relations , no eecient uniication algorithm has been proposed for logic database queries for nested relations. As a result, the required time to process logic database queries for nested relations is often less than ideal. To overcome this shortcoming, we propose here a linear time uniication algorithm for a large cl...
متن کامل